Tabulated Resolution for Well Founded Semantics
نویسندگان
چکیده
Based on the search forest for positive programs as deened by Bol and Degerstedt, we deene a tabulated version of SLS-resolution that is sound and complete w.r.t. well founded semantics. In contrast to SLS-resolution as proposed by Przymusinski and by Ross, a positivistic computation rule is not required. This proposal is closely related to that of Chen and Warren, but it relies on tabulation for both positive and negative recursion. In this way, only one forest needs to be constructed, rather than a forest for each negative context. For function-free programs, the resulting search forest is nite.
منابع مشابه
Computing the Well-Founded Semantics for Constraint Extensions of Datalog
We present a new technique for computing the well-founded semantics for constraint extensions of Datalog :. The method is based on tabulated resolution enhanced with a new reenement strategy for deriving negative conclusions. This approach leads to an eecient and terminating query evaluation algorithm that preserves the goal-oriented nature of the resolution based methods.
متن کاملLinear Tabulated Resolutions for the Well-Founded Semantics
Global SLS-resolution and SLG-resolution are two representative mechanisms for top-down evaluation of the well-founded semantics of general logic programs. Global SLS-resolution is linear but suffers from infinite loops and redundant computations. In contrast, SLG-resolution resolves infinite loops and redundant computations by means of tabling, but it is not linear. The distinctive advantage o...
متن کاملA Top-Down Procedure for Disjunctive Well-Founded Semantics
Skepticism is one of the most important semantic intuitions in artificial intelligence. The semantics formalizing skeptical reasoning in (disjunctive) logic programming is usually named well-founded semantics. However, the issue of defining and computing the well-founded semantics for disjunctive programs and databases has proved to be far more complex and difficult than for normal logic progra...
متن کاملA Goal-Oriented Approach to Computing the Well-Founded Semantics
D Global SLS resolution is an ideal procedural semantics for the well-founded semantics. We present a more effective variant of global SLS resolution, called XOLDTNF resolution, which incorporates simple mechanisms for loop detection and handling. Termination is guaranteed for all programs with the bounded-term-size property. We establish the soundness and (search space) completeness of XOLDTNF...
متن کاملEnhancing global SLS-resolution with loop cutting and tabling mechanisms
Global SLS-resolution is a well-known procedural semantics for top-down computation of queries under the well-founded model. It inherits from SLDNF-resolution the linearity property of derivations, which makes it easy and efficient to implement using a simple stack-based memory structure. However, like SLDNF-resolution it suffers from the problem of infinite loops and redundant computations. To...
متن کامل